Implications of classical scheduling results for real-time systems - Computer

rhs work W U I c!onc 31 hila f h t f i n t c ~ i i ~ f i o r 1% us on \ahbuti<c,! system design and scheduling algorithm and avoiding poor or erroneous choices. The scheduling theory literature is so vast that we can’t pretend to be comprehensive, but this article does present a minimum set of results and their implications. The set includes Jackson’s rule, Smith’s rule, McNaughton’s theorem, Liu and Layland’s rate-monotonic rule, Mok‘s theorems, and Richard’s anomalies. Besides learning about these results, readers should be able to answer, at least, the following questions: